lambda calculus

applicative computing systems – Treatment of objects in the style of the lambda calculus

Cartesian closed category – A setting for lambda calculus in category theory

categorical abstract machine – A model of computation applicable to lambda calculus

Curry–Howard isomorphism – The formal correspondence between programs and proofs

De Bruijn index – notation disambiguating alpha conversions

De Bruijn notation – notation using postfix modification functions

deductive lambda calculus – The consideration of the problems associated with considering lambda calculus as a Deductive system.

domain theory – Study of certain posets giving denotational semantics for lambda calculus

evaluation strategy – Rules for the evaluation of expressions in programming languages

explicit substitution – The theory of substitution, as used in β-reduction

Harrop formula – A kind of constructive logical formula such that proofs are lambda terms

Kleene–Rosser paradox – A demonstration that some form of lambda calculus is inconsistent

Knights of the Lambda Calculus – A semi-fictional organization of LISP and Scheme hackers

Krivine machine – An abstract machine to interpret call-by-name in lambda calculus

lambda calculus definition – Formal definition of the lambda calculus.

let expression – An expression closely related to an abstraction.

Minimalism (computing)

rewriting – Transformation of formulæ in formal systems

SECD machine – A virtual machine designed for the lambda calculus

Scott–Curry theorem – A theorem about sets of lambda terms

To Mock a Mockingbird – An introduction to combinatory logic

universal Turing machine – A formal computing machine that is equivalent to lambda calculus

Unlambda – An esoteric functional programming language based on combinatory logic

/suto3/google.iconlambda calculus